#include <bits/stdc++.h>

#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 1e6 + 10;

mt19937 rnd(time(NULL));

int p[N];

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "w", stdout);
#endif
	int n = 10;
	printf("%d\n", n);
	rep(i, 2, n) {
		int x = rnd() % (i - 1) + 1;
		printf("%d %d %d\n", x, i, 1);
	}
	int x = rnd() % n + 1, y = rnd() % n + 1;
	while(x == y) x = rnd() % n + 1, y = rnd() % n + 1;
	printf("%d %d %d\n", x, y, 1);
	return 0;
}
